BPP: a sequence-based algorithm for branch point prediction
نویسندگان
چکیده
منابع مشابه
Human branch point consensus sequence is yUnAy
Yeast carries a strictly conserved branch point sequence (BPS) of UACUAAC, whereas the human BPS is degenerative and is less well characterized. The human consensus BPS has never been extensively explored in vitro to date. Here, we sequenced 367 clones of lariat RT-PCR products arising from 52 introns of 20 human housekeeping genes. Among the 367 clones, a misincorporated nucleotide at the bran...
متن کاملA Bisection-Like Algorithm for Branch Switching at a Simple Branch Point
At a Simple Branch Point x0 of a parameter-dependent nonlinear system, two distinct solutions branches S1 and S2 intersect. A popular method of branch switching from S1 to S2 at x0 is to use an orthogonal vector to the tangent vector to S1at x0 as an initial guess for the tangent vector to S2 at x0. We describe an improved version of this method using a bisection-like procedure, which is especi...
متن کاملMotion-compensated prediction based algorithm for medical image sequence compression
A method for irreversible compression of medical image sequences is described. The method relies on discrete cosine transform and motion-compensated prediction to reduce intraand inter-frame redundancies in medical image sequences. Simulation examples are presented.
متن کاملA New Maximum Power Point Tracking Method for PEM Fuel Cells Based On Water Cycle Algorithm
Maximum Power Point (MPP) tracker has an important role in the performance of fuel cell (FC) systems improvement. Tow parameters which have effect on the Fuel cell output power are temperature and membrane water. So contents make the MPP change by with variations in each parameter. In this paper, a new maximum power point tracking (MPPT) method for Proton Exchange Membrane (PEM) fuel cell is pr...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2017
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btx401